منابع مشابه
Deciding Global Partial-Order Properties
Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between events. Recently, the use of partial order semantics that allows independent events of concurrent processes to be unordered is becoming popular. Temporal logics that are interpreted over partial orders allow specifications relating global snapshots, and...
متن کاملProving Possibility Properties Proving Possibility Properties
The charter of SRC i s t o a d v ance both the state of knowledge and the state of the art in computer systems. From our establishment in 1984, we have performed basic and applied research to support Digital's business objectives. Our current work includes exploring distributed personal computing on multiple platforms, networking, programming technology, system modelling and management techniqu...
متن کاملOn the Complexity of Partial Order Properties
The recognition complexity of ordered set properties is considered, i.e. how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove a lower bound of (n 2) for properties that are characterized by forbidden substructures of xed size. For the properties being connected, and having exactly k comparable pairs we show that the recognition complexity i...
متن کاملA Hierarchy of Partial Order Temporal Properties
We propose a classification of partial order temporal properties into a hierarchy, which is a generalization of the safety-progress hierarchy of Chang, Manna and Pnueli. The classes of the hierarchy are characterized through three views: language-theoretic, topological and temporal. Instead of the domain of strings, we take the domain of Mazurkiewicz traces as a basis for our considerations. Fo...
متن کاملProving Linearizability Using Partial Orders
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization — a linear order on operations satisfying the data structure’s sequential specification. Proving linearizability is often challenging because an operation’s position in the linearization order may depend on future ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90009-4